Some geometrical aspects of a maximal three-coloured triangle-free graph
نویسندگان
چکیده
منابع مشابه
Cycle-maximal triangle-free graphs
We conjecture that the balanced complete bipartite graph K⌊n/2⌋,⌈n/2⌉ contains more cycles than any other n-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and u...
متن کاملA note on maximal triangle-free graphs
We show that a maximal triangle-free graph on n vertices with minimum degree δ contains an independent set of 3δ − n vertices which have identical neighborhoods. This yields a simple proof that if the binding number of a graph is at least 3/2 then it has a triangle. This was conjectured originally by Woodall. We consider finite undirected graphs on n vertices with minimum degree δ. A maximal tr...
متن کاملMaximal Induced Matchings in Triangle-Free Graphs
An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every n-vertex graph has at most 10 ≈ 1.5849 maximal induced matchings, and this bound is best possible. We prove that every n-vertex triangle-free graph has at most 3 ≈ 1.4423 maximal induced matchings, and this bound is attained by every disjoint union of copies of the complete bipar...
متن کاملStill another triangle-free infinite-chromatic graph
We give a new example of a triangle-free cc-chromatic graph: the vertices of G form a oox oo matrix, V(G) = [vi,i], i, j = 1, 2, ... The vertex vi,i is connected with every vertex of the ( i + j)th column. G is triangle-free: if A has the smallest column-index among {A, B, C}c V(G) and AB, ACEE(G), then B, Care in the same column so BC¢E(G). G is infinite-chromatic: ~ ~ {1, 2, ... } denotes the...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1983
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90043-6